Optimal auction design under non-commitment
نویسنده
چکیده
This paper characterizes revenue maximizing auctions for a nite horizon version of the standard IV P model of Myerson (1981) for a seller who cannot commit not to propose a new mechanism, if previously chosen ones fail to allocate the object. We show that a revenue maximizing mechanism in the rst period assigns the good to the buyer with the highest virtual valuation, provided that it is above a buyer-speci c reserve price. If no buyer obtains the good in the rst period, the same procedure is repeated in the second period, where virtual valuations are calculated using the posterior distributions and the reserves prices are lower, and so forth, until we reach the last period of the game. This is the rst paper that characterizes optimal mechanisms in a multi-agent environment where the designer behaves sequentially rationally. The characterization procedure can be applicable to other multi-agent mechanism design problems with limited commitment.Keywords: mechanism design, optimal auctions, limited commitment. JEL Classi cation Codes: C72, D44, D82.
منابع مشابه
Auctions with Limited Commitment∗
We study auction design with limited commitment in a standard auction environment. The seller has a single object and can conduct an infinite sequence of standard auctions with reserve prices to maximize her expected profit. In each period, the seller can commit to a reserve price for the current period but cannot commit to future reserve prices. We analyze the problem with limited commitment t...
متن کاملFirst–Price Auctions, Seller Information and Commitment to Sell
I consider an independent private values auction environment with risk–neutral buyers and an either risk–neutral or risk–averse seller. My setting differs from standard settings in two respects. First, the seller does not know his reservation value at the time he designs the auction, and second, he cannot commit to selling after observing the outcome of the auction. For general distributions of...
متن کاملPrizes and Lemons Procurement of Innovation under Imperfect Commitment
The literature on R&D contests implicitly assumes that contestants submit their innovation regardless of its value. This ignores a potential adverse selection problem. The present paper analyzes the procurement of innovations when the procurer cannot commit to never bargain with innovators who bypass the contest. We compare fixed-prize tournaments with and without entry fees, and optimal scorin...
متن کاملA Multi-attribute Reverse Auction Framework Under Uncertainty to the Procurement of Relief Items
One of the main activities of humanitarian logistics is to provide relief items for survivors in case of a disaster. To facilitate the procurement operation, this paper proposes a bidding framework for supplier selection and optimal allocation of relief items. The proposed auction process is divided into the announcement construction, bid construction and bid evaluation phases. In the announcem...
متن کاملAlgorithmic Mechanism Design in Dynamic Environments
Algorithmic Mechanism Design in Dynamic Environments by Christos Alexandros Psomas Doctor of Philosophy in Computer Science University of California, Berkeley Professor Christos H. Papadimitriou, Chair Over the past two decades, a new field has emerged between Computer Science and Game Theory: Algorithmic Mechanism Design. Despite tremendous growth and success in tackling a wide variety of prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 159 شماره
صفحات -
تاریخ انتشار 2015